Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL
نویسندگان
چکیده
This paper presents a prefixed tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of different techniques such as prefixed tableaux for modal logics and model checkers for +-calculus. We prove the correctness and completeness of the calculus and illustrate its features. We also discuss the transformation of the tableaux method (naively NEXPTIME) into an EXPTIME algorithm. ] 2000 Academic Press
منابع مشابه
Model Checking and Deduction for Innnite-state Systems
Two well-known approaches to the veriication of reactive systems are deductive veriication and model checking. After brieey reviewing them, we present deductive model checking, which combines these two approaches. The new procedure uses deduction to extend the classical tableau-based model checking algorithms to the case of innnite-state systems.
متن کاملTableaux and Algorithms for Propositional Dynamic Logic with Converse
This paper presents a pre xed tableaux calculus for Proposi tional Dynamic Logic with Converse based on a combination of di erent techniques such as pre xed tableaux for modal logics and model checkers for mu calculus We prove the correctness and completeness of the calcu lus and illustrate its features We also discuss the transformation of the tableaux method naively NEXPTIME into an EXPTIME a...
متن کاملA Cut-Free ExpTime Tableau Decision Procedure for the Logic Extending Converse-PDL with Regular Inclusion Axioms
We give the first cut-free ExpTime (optimal) tableau decision procedure for the logic CPDLreg, which extends Converse-PDL with regular inclusion axioms characterized by finite automata. The logic CPDLreg is the combination of Converse-PDL and regular grammar logic with converse. Our tableau decision procedure uses global state caching and has been designed to increase efficiency and allow vario...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملModel checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context-free programs. The algorithm shows that the model checking problem for PDL remains PTIME-complete in the presence of all these operators, in contrast to the high increase in complexity that they cause for the satisfia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 162 شماره
صفحات -
تاریخ انتشار 2000